Distributed Admission Control for Real-Time Communication over Wormhole-Routed Networks
نویسندگان
چکیده
Wormhole networks provide a very-high-speed communication medium that is well suited for a large number of bandwidth demanding applications. Unfortunately, the lack of buuering in the switches causes blocked packets to transiently monopolize arbitrary large portions of the network, thus making it diicult to give real-time guarantees when connections contend for communication links. We present an eecient, fully distributed admission control scheme for time-critical connections over wormhole networks. We compare this scheme to a centralized algorithm in a suite of simulation experiments and show that its performance is comparable, in particular for highly loaded networks.
منابع مشابه
Distributed Connection Management for Real-Time Communication over Wormhole-Routed Networks
Wormhole networks provide a very-high-speed communication medium that is well suited for a large number of bandwidth demanding applications. Unfortunately, the lack of buffering in the switches causes blocked packets to transiently monopolize arbitrary large portions of the network, thus making it difficult to give real-time guarantees when connections contend for communication links. We presen...
متن کاملTask Assignment on Distributed-memory Systems with Adaptive Wormhole Routing Task Assignment on Distributed-memory Systems with Adaptive Wormhole Routing
Assignment of tasks of a parallel program onto processors of a distributed-memory system is critical to obtain minimal program completion time by minimizing communication overhead. Wormhole-routing switching technique, with various adaptive routing strategies, is increasingly becoming the trend to build scalable distributed-memory systems. This paper presents task assignment heuristics for such...
متن کاملGuaranteed Periodic Real-Time Communication over Wormhole Switched Networks
In this paper, we investigate how to e ciently implement TDMA (Time Division Multiple Access) on a wormhole switched network using a pure software solution in the end nodes. Transmission is con ict free on the time-slot level and hence deadlock free. On the subslot level, however, con icts are possible when using early sending, a method we propose in order to reduce latency while still not haza...
متن کاملThrottle and Preempt: A New Flow Control for Real-Time Communications in Wormhole Networks
In this papel; we study wormhole routed networks and their suitability for real-time trafic in a priority-driven paradigm. A traditional blocking $ow control in wormhole routing may lead to a priority inversion in the sense that high priority packets are blocked by low priority packets for unlimited time. This uncontrolled priority inversion causes the frequent deadline missing. This paper ther...
متن کاملA Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
A new approach to broadcast in wormhole-routed two-and three-dimensional torus networks is proposed. The approach extends the concept of dominating sets from graph theory by accounting for the relative distance-insensitivity of the wormhole routing switching strategy and by taking advantage of an all-port communication architecture. The resulting broadcast operation is based on a tree structure...
متن کامل